Time-based critical infrastructure dependency analysis for large-scale and cross-sectoral failures
نویسندگان
چکیده
Dependency analysis of critical infrastructures is a computationally intensive problem when dealing with large-scale, cross-sectoral, cascading and common-cause failures. The problem intensifies when attempting a dynamic, time-based dependency analysis. This paper extends a previous graph-based risk analysis methodology to dynamically assess the evolution of cascading failures over time. Various growth models are employed to capture slow, linear and rapidly evolving effects, but instead of using static projections, the evolution of each dependency is “objectified” by a fuzzy system that also considers the effects of nearby dependencies. To achieve this, the impact (and, eventually, risk) of each dependency is quantified on the time axis into a form of many-valued logic. In addition, the methodology is extended to analyze major failures triggered by concurrent common-cause cascading events. A critical infrastructure dependency analysis tool, CIDA, that implements the extended risk-based methodology is described. CIDA is designed to assist decision makers in proactively analyzing dynamic and complex dependency risk paths in two ways: (i) identifying potentially underestimated low risk Corresponding author: Marianthi Theocharidou ([email protected]) Preprint submitted to IJCIP December 10, 2015 dependencies and reclassifying them to a higher risk category before they are realized; and (ii) simulating the effectiveness of alternative mitigation controls with different reaction times. Thus, the CIDA tool can be used to evaluate alternative defense strategies for complex, large-scale and multisectoral dependency scenarios and to assess their resilience in a cost-effective manner.
منابع مشابه
Time-based Critical Infrastructure Dependency Analysis for Large-Scale and Cross-Sectoral Failures
Dependency analysis of critical infrastructures is a computationally intensive problem when dealing with large-scale, cross-sectoral, cascading and common-cause failures. The problem intensifies when attempting a dynamic, time-based dependency analysis. This paper extends a previous graph-based risk analysis methodology to dynamically assess the evolution of cascading failures over time. Variou...
متن کاملRisk mitigation strategies for critical infrastructures based on graph centrality analysis
Dependency Risk Graphs have been proposed as a tool to analyze the cascading failures of Critical Infrastructure (CI) dependency chains. However, dependency chain analysis is not by itself sufficient for developing an efficient risk mitigation strategy, i.e. a strategy that defines which CI nodes should have high priority for the application of mitigation controls, in order to achieve the optim...
متن کاملModelling Interdependent Cascading Failures in Real World Complex Networks using a Functional Dependency Model
Infrastructure systems are becoming increasingly complex and interdependent. As a result our ability to predict the likelihood of large-scale failure of these systems has significantly diminished and the consequence of this is that we now have a greatly increased risk of devastating impacts to society. Traditionally these systems have been analysed using physically-based models. However, this a...
متن کاملUsing Centrality Measures in Dependency Risk Graphs for Efficient Risk Mitigation
Cascading failures of Critical Infrastructures (CIs) can be modeled through Dependency Risk Graphs, in order to assess the expected risk of CI dependency chains. In this paper we extend our previous dependency risk analysis methodology towards risk management. We explore the relation between dependency risk paths and graph centrality measures, in order to identify nodes that significantly affec...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJCIP
دوره 12 شماره
صفحات -
تاریخ انتشار 2016